Extreme-scale space-time parallelism
نویسندگان
چکیده
D. Ruprecht∗, R. Speck†∗, M. Emmett‡, M. Bolten§ R. Krause∗, ∗Institute of Computational Science, Università della Svizzera italiana, Lugano, Switzerland. Email: {daniel.ruprecht, rolf.krause}@usi.ch †Jülich Supercomputing Centre, Jülich, Germany. Email: [email protected] ‡Lawrence Berkeley National Laboratory, Berkeley, USA. Email: [email protected] § Department of Mathematics and Science, Bergische Universität Wuppertal, Germany. Email: [email protected]
منابع مشابه
Software Challenges in Extreme Scale Systems
Computer systems anticipated in the 2015 – 2020 timeframe are referred to as Extreme Scale because they will be built using massive multi-core processors with 100’s of cores per chip. The largest capability Extreme Scale system is expected to deliver Exascale performance of the order of 10 operations per second. These systems pose new critical challenges for software in the areas of concurrency...
متن کاملPETSc’s Software Strategy for the Design Space of Composable Extreme-Scale Solvers
Emerging extreme-scale architectures present new opportunities for broader scope of simulations as well as new challenges in algorithms and software to exploit unprecedented levels of parallelism. Composable, hierarchical solver algorithms and carefully designed portable software are crucial to the success of extremescale simulations, because solver phases often dominate overall simulation time...
متن کاملTuple switching network - When slower may be better
This paper reports an application dependent network design for extreme scale high performance computing (HPC) applications. Traditional scalable network designs focus on fast point-to-point transmission of generic data packets. The proposed network focuses on the sustainability of high performance computing applications by statistical multiplexing of semantic data objects. For HPC applications ...
متن کاملEfficient Compilation to Event-Driven Task Programs
As illustrated by the emergence of a class of new languages and runtimes, it is expected that a large portion of the programs to run on extreme scale computers will need to be written as graphs of event-driven tasks (EDTs). EDT runtime systems, which schedule such collections of tasks, enable more concurrency than traditional runtimes by reducing the amount of inter-task synchronization, improv...
متن کاملLoad Bounding for Implicit Parallelism
It is well known that exploiting parallelism beyond the available machine parallelism can lead to vastly increased resource requirements. Programs which can run in linear space under a sequential execution regime may require exponential space in the context of unrestricted parallelism. In this paper we present an efficient adaptive software solution for the problem of avoiding excessive paralle...
متن کامل